Optimal Routing in Several Deterministic Queues with Two Service Times
نویسندگان
چکیده
In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues. RÉSUMÉ. Cet article présente diverses extentions des problèmes de routages optimaux dans des files d’attentes déterministes en parallèle. Notre objectif ici est de calculer une politique de routage qui va minimiser le temps de séjour des clients dans le système. Les cas considérés sont deux files en parallèle, puis N files en parallèle
منابع مشابه
Optimal routing policies in deterministic queues in tandem
In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time of the whole system. We show that the optimal routing is a Sturmian word which density depends on maximum service time on each route. In order to do this, we particularly study the output process of de...
متن کاملOptimal Simulation of Buffer Overflows in - Queueing Systems with Application to ATM Switches*
works is M/M/l queues and Jackson networks, and it is shown how one can find an asymptotically opSimply because of their rarity, the estimation of timal simulation system for simulating buffer overthe statistics of buffer overflows in queueing s y s flows in these systems. H ~ ~ ~ ~ ~ ~ , in con. terns via direct simulation is often very expensive figurations, it is more usual to have systems w...
متن کاملOptimally Efficient Simulation of Buffer Overflows in Queues with Deterministic Service Times via Impor- tance Sampling
Simply because of their rarity, the estimation of the statistics of bufer overflows in queueing systems via direct simulation is often very ezpensive in computer time. Past work on fast simulation using importance sampling has concentrated on systems with Poisson arrival processes and ezponentially distributed service times. However, in practical systems, such as ATM switches, service times are...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملNumerical Solution of Polling Systems for Analyzing Networks on Chips
This paper introduces a numerical solution method for a class of discrete-time polling systems by relying on the power method, Kronecker matrix representations and the shuffle algorithm. The class of polling models considered consists of several infinite pseudo queues, deterministic service times, Bernoulli service and Markovian routing and includes exhaustive, 1-limited and k-limited service a...
متن کامل